Dynamic Decentralized Preemptive Scheduling across Heterogenous Multi-core Desktop Grids

The recent advent of multi-core computing environments increases the heterogeneity of grid resources and the complexity of managing them, making efficient load balancing challenging. In an environment where jobs are submitted regularly into a grid which is already executing several jobs, it becomes important to provide low job turn-around times and high throughput for the users. Typically, the grids employ a First Come First Serve (FCFS) method of executing the jobs in the queue which results in poor average job turnaround times and wait times for most jobs. Hence a conventional FCFS (First come first serve) scheduling strategy does not suffice to reduce the average wait times across all